A Simple Time Scale Decomposition Technique for Stochastic Process Algebras
نویسندگان
چکیده
منابع مشابه
A Simple Time Scale Decomposition Technique for Stochastic Process Algebras
Many modern computer and communication systems result in large, complex performance models. The compositional approach ooered by stochastic process algebra constructs a model from submodels which are smaller and more easily understood. This gives the model a clear component-based structure. In this paper we present cases when this structure may be used to inform the solution of the model, leadi...
متن کاملTime Scale Decomposition of Stochastic Process Algebra Models
Realistic models of computer and communication systems result in large, complex performance models. Compositionality, offered by stochastic process algebra constructs a model from submodels which are smaller and more tractable. We present a technique to exploit this structure in order to enhance the solution of the model by decomposition of the underlying Markov process. The decomposition under...
متن کاملEmbedding Real Time in Stochastic Process Algebras
We present a stochastic process algebra including immediate actions, deadlock and termination, and explicit stochastic delays, in the setting of weak choice between immediate actions and passage of time. The operational semantics is a spent time semantics, avoiding explicit clocks. We discuss the embedding of weak-choice real-time process theories and analyze the behavior of parallel compositio...
متن کاملStochastic Process Algebras
In this tutorial we give an introduction to stochastic process algebras and their use in performance modelling, with a focus on the PEPA formalism. A brief introduction is given to the motivations for extending classical process algebra with stochastic times and probabilistic choice. We then present an introduction to the modelling capabilities of the formalism and the tools available to suppor...
متن کاملSemantic reachability for simple process algebras
This paper is an approach to combine the reachability problem with semantic notions like bisimulation equivalence. It deals with questions of the following form: Is a state reachable that is bisimulation equivalent to a given state ? Here we show some decidability results for process algebras and Petri nets.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Computer Journal
سال: 1995
ISSN: 0010-4620,1460-2067
DOI: 10.1093/comjnl/38.7.566